Large Graph Models: A Review
نویسندگان
چکیده
Large graphs can be found in a wide array of scientific fields ranging from sociology and biology to scientometrics and computer science. Their analysis is by no means a trivial task due to their sheer size and complex structure. Such structure encompasses features so diverse as diameter shrinking, power law degree distribution and self similarity, edge interdependence, and communities. When the adjacency matrix of a graph is considered, then new, spectral properties arise such as primary eigenvalue component decay function, eigenvalue decay function, eigenvalue sign alternation around zero, and spectral gap. Graph mining is the scientific field which attempts to extract information and knowledge from graphs through their structural and spectral properties. Graph modeling is the associated field of generating synthetic graphs with properties similar to those of real graphs in order to simulate the latter. Such simulations may be desirable because of privacy concerns, cost, or lack of access to real data. Pivotal to simulation are lowand high-level software packages offering graph analysis and visualization capabilities. This survey outlines the most important structural and spectral graph properties, a considerable number of graph models, as well the most common graph mining and graph learning tools. ∗Corresponding author: University of Patras, Patras 26500 Hellas, [email protected] Preprint submitted to Journal of Discrete Algorithms January 26, 2016
منابع مشابه
یک الگوریتم ابتکاری برای تجدید آرایش شبکههای توزیع به منظور کاهش تلفات اهمی مبتنی بر نظریهی گراف
One of the ways of reducing active power losses in the distribution networks is using the network reconfiguration for different load levels. Since the number of possible configuration of a distribution network is usually very much and then review of all of them (especially in the network of large-scale) to finding the optimal configuration is not possible simply, therefore in this paper a new a...
متن کاملLPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring
Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...
متن کاملMathematical Models for Microbial Kinetics in Solid-State Fermentation: A Review
Context:In this review, we discuss empirical and stoichiometric models, which have been developed recently in SSF processes and the influence of environmental conditions on the variables of these models. Additionally, new studies on modeling of product formation are also mentioned. <span style="color: windowtext...
متن کاملA novel topological descriptor based on the expanded wiener index: Applications to QSPR/QSAR studies
In this paper, a novel topological index, named M-index, is introduced based on expanded form of the Wiener matrix. For constructing this index the atomic characteristics and the interaction of the vertices in a molecule are taken into account. The usefulness of the M-index is demonstrated by several QSPR/QSAR models for different physico-chemical properties and biological activities of a large...
متن کاملA Review of Peridynamics and its Applications; Part1: The Models based on Peridynamics
Peridynamics is a nonlocal version of the continuum mechanics, in which partial differential equations are replaced by integro-differential ones. Due to not using spatial derivatives of the field variables, it can be applied to problems with discontinuities. In the primary studies, peridynamics has been used to simulate crack propagation in brittle materials. With proving the capabilities of pe...
متن کاملLarge Scale Graph Matching(LSGM): Techniques, Tools, Applications and Challenges
Large Scale Graph Matching (LSGM) is one of the fundamental problems in Graph theory and it has applications in many areas such as Computer Vision, Machine Learning, Pattern Recognition and Big Data Analytics (Data Science). Matching belongs to the combinatorial class of problems which refers to finding correspondence between the nodes of a graph or among set of graphs (subgraphs) either precis...
متن کامل